Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks

نویسندگان

  • Marco Ajmone Marsan
  • Andrea Bianco
  • Emilio Leonardi
  • Fabio Neri
  • Antonio Nucci
چکیده

This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter and one fixed receiver, so that full connectivity can be achieved by tuning transmitters to the different wavelengths. Tuning times are not negligible with respect to the slot time. A centralized network controller allocates slots in a TDM/WDM frame according to (long-term) bandwidth requests issued by users. Simple on-line transparent scheduling strategies are proposed, which accommodate bandwidth requests when they are received (on-line approach), with the constraint of not affecting existing allocations when a new request is served (transparency). Strategies that attempt to allocate in contiguous slots all the transmissions of each source on one wavelength reduce overheads, are simple, and provide good performance. Even better performance can be achieved, at the cost of a modest complexity increase, when the transparency constraint is not strictly imposed, i.e., when a full re-allocation of existing connections is performed once in a while.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal All-to-All Broadcast in WDM Optical Networks with Breakdown or Power-Off Transceivers

Packet scheduling provides a way to reduce routing control and guarantee overall throughput. An interesting special case of the packet scheduling is all-to-all broadcast in which every transmitter/receiver pair has exactly one packet to be transferred. Several optimal scheduling algorithms have been proposed for the all-to-all broadcast problem in Wavelength Division Multiplexed (WDM) optical s...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Scheduling on flexible flow shop with cost-related objective function considering outsourcing options

This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs tha...

متن کامل

Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals

Age of information is a newly proposed metric that captures the freshness of information at end-users. The age measures the amount of time that elapsed since the latest information was generated at a source. In this context, we study an age minimization problem over a wireless broadcast network to keep many users updated on timely information, where only one user can be served at a time. We for...

متن کامل

A New Channel Priority Scheduling Technique for WDM Star Networks

We consider an optical wavelength division multiplexed (WDM) network with broadcast and select architecture. The performance of such a network seriously depends on the resulting scheduling method. Our goal is to improve the performance of the network, in terms of channel utilization and network throughput, using two scheduling techniques: the prediction and the sorting technique. The new propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Transactions on Telecommunications

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2000